Piecewise linear regularized solution paths
نویسندگان
چکیده
منابع مشابه
Piecewise Linear Regularized Solution Paths
We consider the generic regularized optimization problem β̂(λ) = arg minβ L(y,Xβ) + λJ (β). Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407–499] have shown that for the LASSO—that is, if L is squared error loss and J (β)= ‖β‖1 is the 1 norm of β—the optimal coefficient path is piecewise linear, that is, ∂β̂(λ)/∂λ is piecewise constant. We derive a general characterization of ...
متن کاملPiecewise Linear Solution Paths for Parametric Piecewise Quadratic Programs
Recently, pathfollowing algorithms for parametric optimization problems with piecewise linear solution paths have been developed within the field of regularized regression. This paper presents a generalization of these algorithms to a wider class of problems, namely a class of parametric piecewise quadratic programs and related problems. By using pathfollowing algorithms that exploit the piecew...
متن کاملSmoothing of Piecewise Linear Paths
The pointwise traversal of a given path is a popular task in the area of robotics, e.g. in mobile, industrial or surgical robotics. The easiest method to describe paths is by a sequence of linear segments, and for many tasks the precision of a path approximated by linear segments is sufficient. The movements to be accomplished by a mobile robot or the robot’s end-effector are described by a seq...
متن کاملPiecewise Linear Solution Paths for Para- metric Piecewise Quadratic Programs with Application to Direct Weight Optimization
Recently, pathfollowing algorithms for parametric optimization problems with piecewise linear solution paths have been developed within the field of regularized regression. This paper presents a generalization of these algorithms to a wider class of problems, namely a class of parametric piecewise quadratic programs and related problems. It is shown that the approach can be applied to the nonpa...
متن کاملFollowing Curved Regularized Optimization Solution Paths
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpretation. We consider the design of incremental algorithms which follow paths of regularized solutions, as the regularization varies. These approaches often result in methods which are both efficient and highly flexible....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2007
ISSN: 0090-5364
DOI: 10.1214/009053606000001370